Deriving Structural Hylomorphisms From Recursive De nitions

نویسندگان

  • Zhenjiang Hu
  • Hideya Iwasaki
  • Masato Takeichi
چکیده

ion, abstracting recursive function calls to derive hylomorphisms and abstracting maximal non-recursive subterms to structure hylomorphisms. A prototype of our algorithm has been implemented and tested extensively, showing its promise to be embedded in a real system. Finally, our algorithm gives the evidence that hylomorphisms can specify all recursions of interests as claimed in [BdM94].

منابع مشابه

Towards Manipulation of Mutually Recursive Functions

In functional programming, Constructive Algorithmics is one of the promising approaches to program transformation, especially to fusion, in which a concept called hylomorphism plays quite an important role. However, previous studies have mainly focused on programs constructed by single recursive functions, whereas programs constructed by mutual recursion have been little investigated, particula...

متن کامل

Logics for Defeasible Argumentation

4 General features of argument-based semantics 15 4.1 The `unique status assignment' approach . . . . . . . . . . . . . . 17 4.1.1 Fixed-point de nitions . . . . . . . . . . . . . . . . . . . . 17 4.1.2 Recursive de nitions . . . . . . . . . . . . . . . . . . . . . 21 4.2 The `multiple status assignment' approach . . . . . . . . . . . . . 25 4.3 Comparing the two approaches . . . . . . . . . . ...

متن کامل

Inductive Data Type Systems: Strong Normalization

This paper is concerned with the foundations of Inductive Data Type Systems, an extension of pure type systems by inductive data types. IDTS generalize (inductive) types equipped with primitive recursion of higher-type, by providing de nitions of functions by pattern matching of a form which is general enough to capture recursor de nitions for strictly positive inductive types. IDTS also genera...

متن کامل

Probabilities of Causation: Bounds and Identifcation

This paper deals with the problem of estimating the probability that one event was the cause of another in a given scenario. Using structural-semantical de nitions of the probabilities of necessary or su cient causation (or both), we show how to optimally bound these quantities from data obtained in experimental and observational studies, given various assumptions concerning the data-generating...

متن کامل

A Uniform Framework for Concept De nitions in Description Logics

Most modern formalisms used in Databases and Arti cial Intelligence for describing an application domain are based on the notions of class (or concept) and relationship among classes. One interesting feature of such formalisms is the possibility of de ning a class, i.e., providing a set of properties that precisely characterize the instances of the class. Many recent articles point out that the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996